New Step Size Control Algorithm for Semi-Implicit Composition ODE Solvers
نویسندگان
چکیده
Composition is a powerful and simple approach for obtaining numerical integration methods of high accuracy order while preserving the geometric properties basic integrator. Adaptive step size control allows one to significantly increase performance methods. However, there lack efficient algorithms composition solvers due some known difficulties in constructing low-cost embedded local error estimator. In this paper, we propose novel estimator based on difference between semi-implicit CD method semi-explicit midpoint within common scheme. We evaluate adaptive schemes with proposed estimator, comparing it other state-of-the-art approaches. show that ODE algorithm possess higher efficiency than methods, by using comprehensive set nonlinear test problems.
منابع مشابه
Triangularly Implicit Iteration Methods for ODE-IVP Solvers
It often happens that iteration processes used for solving the implicit relations arising in ODE-IVP methods only start to converge rapidly after a certain number of iterations. Fast convergence right from the beginning is particularly important if we want to use so-called step-parallel iteration in which the iteration method is concurrently applied at a number of step points. In this paper, we...
متن کاملImplicit ODE solvers with good local error control for the transient analysis of Markov models
Obtaining the transient probability distribution vector of a continuous-time Markov chain (CTMC) using an implicit ordinary differential equation (ODE) solver tends to be advantageous in terms of run-time computational cost when the product of the maximum output rate of the CTMC and the largest time of interest is large. In this paper, we show that when applied to the transient analysis of CTMC...
متن کاملA New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization
We present a new full Nesterov and Todd step infeasible interior-point algorithm for semi-definite optimization. The algorithm decreases the duality gap and the feasibility residuals at the same rate. In the algorithm, we construct strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem. Every main iteration of the algorithm consists of a feasibili...
متن کاملAn Efficient Step Size Selection for Ode Codes
We give an algorithm for efficient step size control in numerical integration of non– stiff initial value problems, based on a formula tailormade to methods where the numerical solution is compared with a solution of lower order.
متن کاملExtending explicit and linearly implicit ODE solvers for index-1 DAEs
Nonlinear differential-algebraic equations (DAE) are typically solved using implicit stiff solvers based on backward difference formula or RADAU formula, requiring a Newton-Raphson approach for the nonlinear equations or using Rosenbrock methods specifically designed for DAEs. Consistent initial conditions are essential for determining numeric solutions for systems of DAEs. Very few systems of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2022
ISSN: ['1999-4893']
DOI: https://doi.org/10.3390/a15080275